The Degree of a $q$-Holonomic Sequence is a Quadratic Quasi-Polynomial
نویسندگان
چکیده
منابع مشابه
The Degree of a q-Holonomic Sequence is a Quadratic Quasi-Polynomial
A sequence of rational functions in a variable q is q-holonomic if it satisfies a linear recursion with coefficients polynomials in q and qn. We prove that the degree of a q-holonomic sequence is eventually a quadratic quasi-polynomial, and that the leading term satisfies a linear recursion relation with constant coefficients. Our proof uses differential Galois theory (adapting proofs regarding...
متن کاملDetermination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کاملTHE COLORED HOMFLY POLYNOMIAL IS q-HOLONOMIC
We prove that the colored HOMFLY polynomial of a link, colored by symmetric or exterior powers of the fundamental representation, is q-holonomic with respect to the color parameters. As a result, we obtain the existence of an (a, q) super-polynomial of all knots in 3-space. Our result has implications on the quantization of the SL(2,C) character variety of knots using ideal triangulations or th...
متن کاملThe colored Jones function is q–holonomic
A function of several variables is called holonomic if, roughly speaking, it is determined from finitely many of its values via finitely many linear recursion relations with polynomial coefficients. Zeilberger was the first to notice that the abstract notion of holonomicity can be applied to verify, in a systematic and computerized way, combinatorial identities among special functions. Using a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/2000